Gaussian Half-Duplex Relay Networks: Improved Constant Gap and Connections With the Assignment Problem
نویسندگان
چکیده
منابع مشابه
On Gaussian Half-Duplex Relay Networks
This paper considers Gaussian relay networks where a source transmits a message to a sink terminal with the help of one or more relay nodes. The relays work in half-duplex mode, in the sense that they can not transmit and receive at the same time. For the case of one relay, the generalized Degrees-of-Freedom is characterized first and then it is shown that capacity can be achieved to within a c...
متن کاملAchievable Rates Of Half-Duplex Relay Networks
This paper discusses two coding approaches for a network of half-duplex relay terminals and presents achievable rates for the discrete memoryless relay channel. Both proposals gain on an implicit (in case of compress-and-forward) or explicit (in case of decode-and-forward) inter-relay cooperation.
متن کاملCompressive cooperation for gaussian half-duplex relay channel
Motivated by the compressive sensing (CS) theory and its close relationship with low-density parity-check code, we propose compressive transmission which utilizes CS as the channel code and directly transmits multi-level CS random projections through amplitude modulation. This article focuses on the compressive cooperation strategies in a relay channel. Four decode-and-forward (DF) strategies, ...
متن کاملProtocols and Performance Limits for Half-Duplex Relay Networks
The density of radio access points in currently deployed cellular networks increases in order to improve the reuse of available resources and to serve more user terminals at high data rates. This implies higher deployment costs, which demands low-cost and flexible alternatives. However, this ambitious goal cannot be accomplished with conventional cellular systems but requires new technologies s...
متن کاملOn Min-Cut Algorithms for Half-Duplex Relay Networks
Computing the cut-set bound in half-duplex relay networks is a challenging optimization problem, since it requires finding the cut-set optimal half-duplex schedule. This subproblem in general involves an exponential number of variables, since the number of ways to assign each node to either transmitter or receiver mode is exponential in the number of nodes. We present a general technique that t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2014
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2014.2314636